package com.acyouzi.leetcode.dp;

/**
 * 17/9/22 23:05
 *
 * @author sunxu
 */
public class LongestPalindromicSubsequence {
  // https://leetcode.com/problems/longest-palindromic-substring/discuss/
//  public int longestPalindromeSubseq(String s) {
//    int len = s.length();
//    int[][] dp = new int[len][len];
//    for (int i = 0; i < len; i++) {
//      dp[i][i] = 1;
//      for (int j = i+1; j < len; j++) {
//        if (s.charAt(i) == s.charAt(j)){
//          dp[i][j] = dp[i+1][j-1] + 2;
//        } else {
//
//        }
//      }
//    }
//  }
}
